Fault Tolerant Routings in Complete Multipartite Graph
نویسندگان
چکیده
The f -tolerant arc-forwarding index for a class of complete multipartite graphs are determined by constructing relevant fault tolerant routings. Furthermore, these routings are leveled for Cocktail-party graph and the complete 3-partite graph. Mathematics Subject Classification: 05C38, 05C90, 90B10
منابع مشابه
Optical index of fault tolerant routings in WDM networks
Maňuch and Stacho [7] introduced the problem of designing f -tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur in the network. In this paper, we provide f -tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc-forwarding index and the optical index. These co...
متن کاملEfficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs
Wada, K. and K. Kawaguchi, Efficient fault-tolerant fixed routings on (k+ 1)connected digraphs, Discrete Applied Mathematics 37/38 (1992) 539-552. Consider a directed communication network G in which a limited number of directed link and/or node faults F might occur. A routing Q for the network (a fixed path for each ordered pair of nodes) must be chosen without knowing which components might b...
متن کاملCombinatorial constructions of fault-tolerant routings with levelled minimum optical indices
The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new conc...
متن کاملOptimal Fault-Tolerant Routings on Surviving Route Graph Model
Consider a communication network or an undirected graph G in which a limited number of link and/or node faults F might occur. A routing for the network(at most one path called route for each ordered pair of nodes) must be chosen without knowing which components might be faulty. The diameter of the surviving route graph R(G; )=F , where two nonfaulty nodes x and y are connected by a directed edg...
متن کاملOptimal fault-tolerant routings with small routing tables for k-connected graphs
We study the problem of designing fault-tolerant routings with small routing tables for a kconnected network of n processors in the surviving route graph model. The surviving route graph R(G,ρ)/F for a graph G, a routing ρ and a set of faults F is a directed graph consisting of nonfaulty nodes of G with a directed edge from a node x to a node y iff there are no faults on the route from x to y. ...
متن کامل